Performance and Tuning Series: Locking and Concurrency Control

ثبت نشده
چکیده

SAP ® Adaptive Server ® Enterprise is a high-performance relational database management system for mission-critical, data-intensive environments. It ensures highest operational efficiency and throughput on a broad range of platforms. Configuring locks in SAP ASE includes understanding locking and data consistency, the granularity of locks, types of locks, lock compatibility, and how isolation levels affect locking. SAP ® Adaptive Server ® Enterprise (SAP ® ASE) protects the tables, data pages, or data rows used by active transactions by locking them. Locking is a concurrency control mechanism: it ensures the consistency of data within and across transactions. Locking is necessary in a multiuser environment, since several users may be working with the same data at the same time. Locking affects performance when one process holds locks that prevent another process from accessing needed data. This is called lock contention. The process that is blocked by the lock sleeps until the lock is released. A more serious impact on performance arises from deadlocks. A deadlock occurs when two user processes each have a lock on a page, row, or table and each process wants to acquire a lock on the page, row, or table held by the other. The transaction with the least accumulated CPU time is killed and all of its work is rolled back. Understanding the types of locks in SAP ASE can help to reduce lock contention and avoid or minimize deadlocks. Data consistency means that if multiple users repeatedly execute a series of transactions, the results are correct for each transaction, each time. Simultaneous retrievals and modifications of data do not interfere with each other: the results of queries are consistent. In this table example, transactions T1 and T2 are attempting to access data at approximately the same time. T1 is updating values in a column, while T2 needs to report the sum of the values. T1 Event Sequence T2 begin transaction update account set balance = balance-100 where acct_number = 25 update account set balance = balance + 100 where acct_number = 45 commit transaction T1 and T2 start. T1 up­ dates balance for one account by sub­ tracting $100. T2 queries the sum bal­ ance, which is off by $100 at this point in time—should it return results now, or wait until T1 ends? T1 up­ dates balance of the other account by add­ ing the $100. T1 ends. begin transaction select sum(balance) from account where …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Modeling of an Enhanced Optimistic Locking Architecture for Concurrency Control in a Distributed Database System

Optimistic methods of concurrency control are gaining popularity. This is especially true with the resurgence of mobile and distributed databases during the last decade, which inherently rely on optimistic techniques to improve availability and performance of the distributed database systems. A key problem with optimistic techniques is that they do not perform well in highly conflict prone envi...

متن کامل

Application of an Additive Self-tuning Controller for Static Synchronous Series Compensator for Damping of Sub-synchronous Resonance Oscillations

In this paper, an additive self-tuning (ST) control scheme is presented for a static synchronous series compensator (SSSC) to improve performance of conventional PI control system for damping sub-synchronous resonance (SSR) oscillations. The active and reactve series compensation are provided by a three-level 24-pulse SSSC and fixed capacitor. The proposed ST controller consists of a pole shift...

متن کامل

Title : Bounded Locking for Optimistic Concurrency Control

Optimistic methods of concurrency control are gaining popularity. This is especially true with the resurgence of mobile and distributed databases, which inherently rely on optimistic techniques to improve availability and performance of the database system. A key problem with optimistic techniques is that they do not perform well in highly conflict prone environments. Pessimistic techniques, es...

متن کامل

Semantic multigranularity locking and its performance in object-oriented database systems

Concurrency control schemes for object-oriented database systems (OODBSs) used in the area of performance-critical applications should increase the degree of concurrency and decrease locking overhead in order to offer maximum performance. However, most commercially available OODBSs use conventional concurrency control schemes that never exploit the rich semantics of object-oriented data model, ...

متن کامل

A general concurrency control for database systems

The concurrency control problem in database systems has been examined by many people and several concurrency control algorithms have been proposed. The most popular concurrency controls are two-phase locking and timestamp ordering. This paper reviews both algorithms and shows that they are special cases of a more general concurrency control algorithm. This concurrency control algorithm is descr...

متن کامل

Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes

Due to its potential for a high degree of parallelism, optimistic concurrency control is expected to perform better than two-phase locking when integrated with priority-driven CPU scheduling in real-time database systems. In this paper, we examine the overall effects and the impact of the overheads involved in implementing real-time optimistic concurrency control. Using a locking mechanism to e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014